Lower Bounds for the Complexity of the Voronoi Diagram of Polygonal Curves under the Discrete Frechet Distance
نویسندگان
چکیده
We give lower bounds for the combinatorial complexity of the Voronoi diagram of polygonal curves under the discrete Fréchet distance. We show that the Voronoi diagram of n curves in R with k vertices each, has complexity Ω(n) for dimension d = 1, 2 and Ω(nd(k−1)+2) for d > 2.
منابع مشابه
Voronoi Diagram of Polygonal Chains under the Discrete Fréchet Distance
Polygonal chains are fundamental objects in many applications like pattern recognition and protein structure alignment. A well-known measure to characterize the similarity of two polygonal chains is the famous (continuous/discrete) Fréchet distance. In this paper, for the first time, we consider the Voronoi diagram of polygonal chains in d-dimension under the discrete Fréchet distance. Given a ...
متن کاملVoronoi Diagram for Convex Polygonal Sites with Convex Polygon-Offset Distance Function
The concept of convex polygon-offset distance function was introduced in 2001 by Barequet, Dickerson, and Goodrich. Using this notion of point-to-point distance, they showed how to compute the corresponding nearestand farthest-site Voronoi diagram for a set of points. In this paper we generalize the polygon-offset distance function to be from a point to any convex object with respect to an m-si...
متن کاملComputing generalized higher-order Voronoi diagrams on triangulated surfaces
We present an algorithm for computing exact shortest paths, and consequently distance functions, from a generalized source (point, segment, polygonal chain or polygonal region) on a possibly non-convex triangulated polyhedral surface. The algorithm is generalized to the case when a set of generalized sites is considered, providing their distance field that implicitly represents the Voronoi diag...
متن کاملGeneralized Voronoi Diagrams on Polyhedral Terrains
We present an algorithm for computing exact shortest paths, and consequently distances, from a generalized source (point, segment, polygonal chain or polygonal region) on a polyhedral terrain in which polygonal chain or polygon obstacles are allowed. We also present algorithms for computing discrete Voronoi diagrams of a set of generalized sites (points, segments, polygonal chains or polygons) ...
متن کاملStraight Skeletons for General Polygonal
A novel type of skeleton for general polygonal gures, the straight skeleton S(G) of a planar straight line graph G, is introduced and discussed. Exact bounds on the size of S(G) are derived. The straight line structure of S(G) and its lower combinatorial complexity may make S(G) preferable to the widely used Voronoi diagram (or medial axis) of G in several applications. We explain why S(G) has ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0708.1909 شماره
صفحات -
تاریخ انتشار 2007